A Data Structure for the Construction and Navigation of 3D Voronoi and Delaunay Cell Complexes
نویسندگان
چکیده
The Voronoi diagram (VD) and the Delaunay triangulation (DT) can be used for modelling different kinds of data for different purposes. These two structures are attractive alternatives to rasters to discretise a continuous phenomenon such as the percentage of gold in the soil, the temperature of the water, or the elevation of a terrain. They can also be used to represent the boundaries of real-world features, for example geological modelling of strata or cadastral models of apartment buildings. The VD and the DT are an appealing solution because of their duality (they represent the same thing, just from a different point of view) and because both structures have interesting properties (see Aurenhammer [Aur91] for a review of the properties and potential applications).
منابع مشابه
Augmented Quad-edge – 3d Data Structure for Modelling of Building Interiors
This work presents a new approach towards the construction and manipulation of 3D cells complexes, stored in the Augmented Quad-Edge (AQE) data structure. Each cell of a complex is constructed using the usual Quad-Edge structure, and the cells are then linked together by the dual edge that penetrates the face shared by two cells. We developed a new set of atomic operators that allow for a signi...
متن کاملQuasi-triangulation and interworld data structure in three dimensions
It is well-known that the Voronoi diagram of points and the power diagram for weighted points, such as spheres, are cell complexes, and their respective dual structures, i.e. the Delaunay triangulation and the regular triangulation, are simplicial complexes. Hence, the topologies of these diagrams are usually stored in their dual complexes using a very compact data structure of arrays. The topo...
متن کاملdesigning and implementing a 3D indoor navigation web application
During the recent years, the need arises for indoor navigation systems for guidance of a client in natural hazards and fire, due to the fact that human settlements have been complicating. This research paper aims to design and implement a visual indoor navigation web application. The designed system processes CityGML data model automatically and then, extracts semantic, topologic and geometric...
متن کاملEfficient Proximity Search for -D Cuboids
In this paper, we give the definition for the voronoi diagram and its dual graph – Delaunay triangulation for 3D cuboids. We prove properties of the 3D Delaunay triangulation, and provide algorithms to construct and update the Delaunay triangulation. The Delaunay triangulation data structure is used to perform proximity searches for both static and kinetic cases. We describe experimental result...
متن کاملVoronoi diagrams in Cgal
In this paper we describe a generic C++ adaptor, that adapts a 2-dimensional triangulated Delaunay graph and to the corresponding a Voronoi diagram, represented as a doubly connected edge list (DCEL) data structure. Our adaptor has the ability to automatically eliminate, in a consistent manner, degenerate features of the Voronoi diagram, that are artifacts of the requirement that Delaunay graph...
متن کامل